package algorithm_demo.leetcode;

/**
 * 4. 寻找两个正序数组的中位数
 * <a href="https://leetcode.cn/problems/median-of-two-sorted-arrays/"></a>
 * @author Api
 * @date 2023/4/7 0:28
 */
public class Problem_0004_FindMedianSortedArrays {

    public static double findMedianSortedArrays(int[] nums1, int[] nums2){
        int n1 = nums1.length;
        int n2 = nums2.length;
        if (n1 > n2){
            return findMedianSortedArrays(nums2, nums1);
        }
        int k = (n1 + n2 + 1) / 2;
        return 0;
    }

}
